A Quantum Cryptosystem Secure Against Beamsplitting Attacks
نویسندگان
چکیده
An important area in computer and communications security research is to make various pioneering ideas practical. In this paper we develop a new cryptographic key distribution system based on the uncertainty principle in quantum physics. The new system employs a novel technique that mixes two quantum states in the transmission of photonic signals. On one hand, this technique forces an eavesdropper to extract more signal energy in an eavesdropping process, which renders an eavesdropping attempt easily detectable. And on the other hand,it allows legitimate communicants to transmit higher power photonic signals, whereby secure communications are made possible over a signiicantly longer haul than any other system based on the same principle could support. Another contribution of this paper is to present a new powerful attack based on a pair of beamsplitters. We show that while a well-known quantum key distribution system proposed previously is prone to the new attack, our system is immune to it.
منابع مشابه
Achieving 128-bit Security against Quantum Attacks in Openvpn
Niederreiter is a candidate post-quantum cryptosystem. Its large public key size currently discourages its use in practice. We demonstrate and evaluate how Niederreiter can be used for quantum-secure key exchanges by implementing it in OpenVPN. We contribute an analysis of how much Grover’s algorithm can speed up existing attacks on Niederreiter and McEliece and what code parameters can protect...
متن کاملMasking Large Keys in Hardware: A Masked Implementation of McEliece
Instantiations of the McEliece cryptosystem which are considered computationally secure even in a post-quantum era still require hardening against side channel attacks for practical applications. Recently, the first differential power analysis attack on a McEliece cryptosystem successfully recovered the full secret key of a state-of-the-art FPGA implementation of QC-MDPC McEliece. In this work ...
متن کاملPublic-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
We show how to construct a public-key cryptosystem (as originally deened by Diie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before.
متن کاملDifferential Properties of the HFE Cryptosystem
Multivariate Public Key Cryptography (MPKC) has been put forth as a possible post-quantum family of cryptographic schemes. These schemes lack provable security in the reduction theoretic sense, and so their security against yet undiscovered attacks remains uncertain. The effectiveness of differential attacks on various field-based systems has prompted the investigation of differential propertie...
متن کاملError-correcting pairs for a public-key cryptosystem
Code-based cryptography is an interesting alternative to classic number-theory PKC since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryptosystems, one of the main requirements is having high performance t-bounded decoding algorithms which in the case of having an error-correcting pair is achieved. In this article the clas...
متن کامل